Semiring-Based Constraint Satisfaction and Optimization STEFANO BISTARELLI, UGO MONTANARI, AND FRANCESCA ROSSI University of Pisa, Pisa, Italy

Source URL: pdfs.semanticscholar.org

A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems Christian Bessiere1 , Remi Coletta1 , Fr´ed´eric Koriche1 , and Barry O’Sullivan2 1 LIRMM, CNRS / U. Montpellier, Montpellier, Franc

Source URL: www.lirmm.fr

Distance Constraint Satisfaction Problems Manuel Bodirsky∗ Victor Dalmau† Michael Pinsker§

Source URL: www.bedewell.com

Optimality Theory and Human Sentence Processing* Edward Gibson and Kevin Broihier, Massachusetts Institute of Technology This paper applies the idea of a winner-take-all constraint satisfaction system like that found in

Source URL: tedlab.mit.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

Source URL: www.cs.toronto.edu

The Dichotomy for Conservative Constraint Satisfaction Problems Revisited Libor Barto Department of Mathematics and Statistics, McMaster University, Hamilton, ON, Canada and Department of Algebra, Charles University, Pra

Source URL: www.fields.utoronto.ca

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan∗ Department of EECS UC Berkeley

Source URL: www.cs.toronto.edu

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Source URL: www.bedewell.com

• Computational complexity theory
• Logic
• Complexity classes
• Mathematical logic
• PSPACE
• FO
• Second-order logic
• P versus NP problem
• Constraint satisfaction problem
• NP
• P
• Constraint satisfaction

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

Source URL: www.fields.utoronto.ca

• Logic
• Constraint programming
• Constraint satisfaction problem
• Model theory
• Abstraction
• Philosophy
• Constraint satisfaction
• Satisfiability
• Algebraic structure